A New Self-Reproducing Cellular Automaton Capable of Construction and Computation
نویسنده
چکیده
We present a new self-reproducing cellular automaton capable of construction and computation beyond self-reproduction. Our automaton makes use of some of the concepts developed by Langton for his self-reproducing automaton, but provides the added advantage of being able to perform independent constructional and computational tasks alongside self-reproduction. Our automaton is capable, like Langton's automaton and with comparable complexity, of simple self-replication, but it also provides (at the cost, naturally, of increased complexity) the option of attaching to the automaton an executable program which will be duplicated and executed in each of the copies of the automaton. After describing in some detail the self-reproduction mechanism of our automaton, we provide a non-trivial example of its constructional
منابع مشابه
Von Neumann's Self-Reproducing Automata
John von Neumann's kinematic and cellular automaton systems are described. A complete informal description of the cellular system is presented including an explanation of the realization of logical components, the design of computer organs, the construction, destruction and movement of organs by sequences of internally originated pulses, universal computation and construction, and self-reproduc...
متن کاملA Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملZeno Squeezing of Cellular Automata
We have recently introduced two new models of computations: self-similar cellular automata and self-similar Petri nets. Self-similar automata result from a progressive, infinite tessellation of space and time. Self-similar Petri nets consist of a potentially infinite sequence of coupled transitions with ever increasing firing rates. Both models are capable of hypercomputations and can, for inst...
متن کاملUniversality and Complexity in Cellular Automata
Cellular automata are discrete dynamical systems with simple construction but complex self-organizing behaviour. Evidence is presented that all one-dimensional cellular automata fall into four distinct universality classes. Characterizations of the structures generated in these classes are discussed. Three classes exhibit behaviour analogous to limit points, limit cycles and chaotic attractors....
متن کاملCellular Automata and Artiicial Life | Computation and Life in Reversible Cellular Automata |
In this paper, we investigate and discuss the problem how the abilities of computing and self-reproduction can be realized in a \reversible" environment, especially in reversible cellular automata (RCA). An RCA is a \backward deterministic" CA in which every conngu-ration of the cellular space has at most one predecessor. Such systems have a close connection to physical reversibility, and have ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995